On Computing Straight Skeletons by Means of Kinetic Triangulations
نویسندگان
چکیده
We study the computation of the straight skeleton of a planar straight-line graph (PSLG) by means of the triangulation-based wavefront propagation proposed by Aichholzer and Aurenhammer in 1998, and provide both theoretical and practical insights. As our main theoretical contribution we explain the algorithmic extensions and modifications of their algorithm necessary for computing the straight skeleton of a general PSLG within the entire plane, without relying on an implicit assumption of general position of the input, and when using a finiteprecision arithmetic. We implemented this extended algorithm in C and report on extensive experiments. Our main practical contribution is (1) strong experimental evidence that the number of flip events that occur in the kinetic triangulation of real-world data is linear in the number n of input vertices, (2) that our implementation, Surfer, runs in O(n log n) time on average, and (3) that it clearly is the fastest straight-skeleton code currently available.
منابع مشابه
An Experimental Analysis of Floating-Point Versus Exact Arithmetic
In this paper we investigate how sophisticated floatingpoint codes that are in real-world use – VRONI for computing Voronoi diagrams, FIST for computing triangulations, and BONE for computing straight skeletons – can benefit from the use of the Core library (for exact geometric computing) or the MPFR library (for multiprecision arithmetic). We also discuss which changes to the codes were necess...
متن کاملA Fast Straight-Skeleton Algorithm Based on generalized Motorcycle Graphs
This paper deals with the fast computation of straight skeletons of planar straightline graphs (PSLGs) at an industrial-strength level. We discuss both the theoretical foundations of our algorithm and the engineering aspects of our implementation Bone. Our investigation starts with an analysis of the triangulation-based algorithm by Aichholzer and Aurenhammer and we prove the existence of flip-...
متن کاملTitle: Computing Mitered Offset Curves Based on Straight Skeletons
Introduction: The straight skeleton of a polygon in 2D was first defined by Aichholzer et al. [2]. It is the geometric graph whose edges are the traces of vertices of shrinking mitered offset curves of the polygon, see Figure 1, left. Straight skeletons are a versatile tool in computational geometry and have found applications in diverse fields of industry and science. E.g., Tomoeda et al. use ...
متن کاملStraight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions
We consider the question under which circumstances the straight skeleton and the Voronoi diagram of a given input shape coincide. More precisely, we investigate convex distance functions that stem from centrally symmetric convex polyhedra as unit balls and derive sufficient and necessary conditions for input shapes in order to obtain identical straight skeletons and Voronoi diagrams with respec...
متن کاملComputing straight skeletons of planar straight-line graphs based on motorcycle graphs
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introduce a wavefront-propagation algorithm that circumvents the expensive search for the next split event. Our algorithm maintains the simplicity of the triangulation-based algorithm by Aichholzer and Aurenhammer but has a ...
متن کامل